Characterization of Boolean Valued Star and Mega Lattice Functions
نویسندگان
چکیده
منابع مشابه
LATTICE-VALUED CATEGORIES OF LATTICE-VALUED CONVERGENCE SPACES
We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...
متن کاملQuantum Evaluation of Multi-Valued Boolean Functions
Our problem is to evaluate a multi-valued Boolean function F through oracle calls. If F is one-to-one and the size of its domain and range is the same, then our problem can be formulated as follows: Given an oracle f(a, x) : {0, 1}n × {0, 1}n → {0, 1} and a fixed (but hidden) value a0, we wish to obtain the value of a0 by querying the oracle f(a0, x). Our goal is to minimize the number of such ...
متن کاملMultiplicative complexity of vector valued Boolean functions
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called ΣΠΣ circuits, we show that there is a tight connection between error correcting codes and circuits computing functions with high nonlinearity. Combining this with known coding theo...
متن کاملLattice-Valued Possibilistic Entropy Functions
Lattice-valued entropy functions defined by a lattice-valued possibilistic distribution π on a space Ω are defined as the expected value (in the sense of Sugeno integral) of the complement of the value π(ω) with ω ranging over Ω. The analysis is done in parallel for two alternative interpretations of the notion of complement in the complete lattice in question. Supposing that this complete latt...
متن کاملA Theory of Boolean Valued Functions and Partitions
In this paper Y denotes a non empty set. Let k, l be elements of Boolean. The functor k ⇒ l is defined by: (Def. 1) k ⇒ l = ¬k ∨ l. The functor k ⇔ l is defined as follows: (Def. 2) k ⇔ l = ¬(k ⊕ l). Let k, l be elements of Boolean. The predicate k ⋐ l is defined by: (Def. 3) k ⇒ l = true. Let us note that the predicate k ⋐ l is reflexive. One can prove the following three propositions: (1) For...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Journal of Algebra
سال: 2011
ISSN: 1994-540X
DOI: 10.3923/aja.2012.1.10